Simple groups with the same prime graph as 2Dn(q)
نویسندگان
چکیده
منابع مشابه
Simple groups with the same prime graph as $D_n(q)$
Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...
متن کاملsimple groups with the same prime graph as $d_n(q)$
vasil'ev posed problem 16.26 in [the kourovka notebook: unsolved problems in group theory, 16th ed.,sobolev inst. math., novosibirsk (2006).] as follows:does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? conjecture: $k = 5$.in [zvezdina, on nonabelian simple groups having the same prime gr...
متن کاملOn some Frobenius groups with the same prime graph as the almost simple group ${ {bf PGL(2,49)}}$
The prime graph of a finite group $G$ is denoted by $Gamma(G)$ whose vertex set is $pi(G)$ and two distinct primes $p$ and $q$ are adjacent in $Gamma(G)$, whenever $G$ contains an element with order $pq$. We say that $G$ is unrecognizable by prime graph if there is a finite group $H$ with $Gamma(H)=Gamma(G)$, in while $Hnotcong G$. In this paper, we consider finite groups with the same prime gr...
متن کاملSIMPLE GROUPS WITH THE SAME PRIME GRAPH AS 2Dn(q)
In 2006, Vasil’ev posed the problem: Does there exist a positive integer k such that there are no k pairwise nonisomorphic nonabelian finite simple groups with the same graphs of primes? Conjecture: k = 5. In 2013, Zvezdina, confirmed the conjecture for the case when one of the groups is alternating. We continue this work and determine all nonabelian simple groups having the same prime graphs a...
متن کاملGroups with the Same Prime Graph as an Almost Sporadic Simple Group
Let G be a finite group. We denote by Γ(G) the prime graph of G. Let S be a sporadic simple group. M. Hagie in (Hagie, M. (2003), The prime graph of a sporadic simple group, Comm. Algebra, 31: 44054424) determined finite groups G satisfying Γ(G) = Γ(S). In this paper we determine finite groups G such that Γ(G) = Γ(A) where A is an almost sporadic simple group, except Aut(McL) and Aut(J2).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications de l'Institut Mathematique
سال: 2015
ISSN: 0350-1302,1820-7405
DOI: 10.2298/pim150304024k